Modifiable Array Data Structures for Mesh Topology
نویسندگان
چکیده
Topological data structures are useful in many areas, including the various mesh data structures used in finite element applications. Based on the graph-theoretic foundation for these data structures, we begin with a generic modifiable graph data structure and apply successive optimizations leading to a family of mesh data structures. The results are compact array-based mesh structures that can be modified in constant time. Specific implementations for finite elements and graphics are studied in detail and compared to the current state of the art.
منابع مشابه
Processor Array Requirements for Advanced Image Processing: Theory and Experiment
Two topics are described. The first is the use of connection or reachability matrices as pictorial aids in the investigation of fixed-geometry processor arrays. Matrices are shown for mesh and hypercube arrays and also for a connection topology which is based on hashing. The second topic is an explanation why Hopfield-style associative memories exhibit large variations in the recall strength of...
متن کاملCompact Array-Based Mesh Data Structures
In this paper, we present simple and efficient array-based mesh data structures, including a compact representation of the half-edge data structure for surface meshes, and its generalization—a half-face data structure—for volume meshes. These array-based structures provide comprehensive and efficient support for querying incidence, adjacency, and boundary classification, but require substantial...
متن کاملComputational Topology in Reconstruction, Mesh Generation, and Data Analysis
Many applications involving shapes and data not only require analyzing and processing their geometries, but also associated topologies. In the past two decades, computational topology, an area rekindled by computational geometry has emphasized processing and exploiting topological structures of shapes and data. The understanding of topological structures in the context of computations has resul...
متن کاملCOMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION
In the present paper, an approach is proposed for structural topology optimization based on combination of Radial Basis Function (RBF) Level Set Method (LSM) with Isogeometric Analysis (IGA). The corresponding combined algorithm is detailed. First, in this approach, the discrete problem is formulated in Isogeometric Analysis framework. The objective function based on compliance of particular lo...
متن کاملMesh Routing Topologies for Multi-FPGA Systems
There is currently great interest in using fixed arrays of FPGAs for logic emulators, custom computing devices, and software accelerators. An important part of designing such a system is determining the proper routing topology to use to interconnect the FPGAs. This topology can have a great effect on the area and delay of the resulting system. Tree, Bipartite Graph, and Mesh interconnection sch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 39 شماره
صفحات -
تاریخ انتشار 2017